Incremental Versus Non-incremental: Data and Algorithms Based on Ordering Relations
نویسندگان
چکیده
منابع مشابه
Incremental Versus Non-incremental: Data and Algorithms Based on Ordering Relations
Based on multi-dominance discernibility matrices, a non-incremental algorithm RIDDM and an incremental algorithm INRIDDM are proposed by means of Dominance-based Rough Set Approach. For the incremental algorithm, when a new object arrives, after updating one row or one column in the matrix, we could get the updated rule sets. Time complexity analysis and experimental results show that the incre...
متن کاملFaster Algorithms for Incremental Topological Ordering
We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m) amortized time per arc and our second algorithm takes O(n/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m) bound improves the best p...
متن کاملIncremental Tree-Based Missing Data Imputation with Lexicographic Ordering
In the framework of data imputation, this paper provides a non-parametric approach to missing data imputation based on Information Retrieval. In particular, an incremental procedure based on the iterative use of a tree-based method is proposed and a suitable Incremental Imputation Algorithm is introduced. The key idea is to define a lexicographic ordering of cases and variables so that conditio...
متن کاملIncremental learning based on non-incremental in- duction algorithm
The machine learning algorithms can be divided into two general types: non-incremental that processes all training examples at once and incremental that handles examples one by one. This paper describes the multi-layer incremental inference algorithm (MLII) [1] based on the non-incremental inductive inference algorithm CN2 [2]. In original, the MLII algorithm used linked with the non-incrementa...
متن کاملIncremental algorithms on lists
Incremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc. Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering the possible diierent edit actions on the data type lists, the basic data type used in spreadsheet pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2011
ISSN: 1875-6883
DOI: 10.2991/ijcis.2011.4.1.10